I63. Interactive Short Cases Focused on Muskuloskeletal Diseases with Keypad Voting
نویسندگان
چکیده
منابع مشابه
Interactive Annotation Learning with Indirect Feature Voting
We demonstrate that a supervised annotation learning approach using structured features derived from tokens and prior annotations performs better than a bag of words approach. We present a general graph representation for automatically deriving these features from labeled data. Automatic feature selection based on class association scores requires a large amount of labeled data and direct votin...
متن کاملOn quantum interactive proofs with short messages
This paper proves one of the open problems posed by Beigi, Shor and Watrous in [ToC, Volume 7, Article 7, pp. 101–117, 2011]. We consider quantum interactive proof systems where, in the beginning, the verifier and prover send messages to each other, with the combined length of all messages being at most logarithmic (in the input length); and at the end, the prover sends a polynomial-length mess...
متن کاملInteractive Consistency Algorithms based on Voting and Error-correcting Codes
This paper presents a new class of synchronous deterministic non-authenticated algorithms for reaching interactive consistency (Byzantine agreement). The algorithms are based on voting and error-correcting codes and require considerably less data communication than the original algorithm, whereas the number of rounds and the number of modules meet the minimum bounds. These algorithm based on vo...
متن کاملNon-interactive Zero-Knowledge Arguments for Voting
In voting based on homomorphic threshold encryption, the voter encrypts his vote and sends it in to the authorities that tally the votes. If voters can send in arbitrary plaintexts then they can cheat. It is therefore important that they attach an argument of knowledge of the plaintext being a correctly formed vote. Typically, these arguments are honest verifier zero-knowledge arguments that ar...
متن کاملInteractive Proof Search with Ludics: Short Abstract
Proof Theory and Computation. Recent developments in proof theory have led to major advances in the theory of programming languages. The modelling of computation using proofs impacted deeply the foundational studies of programming languages as well as many of their practical issues. Declarative programming languages have been related mainly in two ways to the mathematical theory of proofs: on t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rheumatology
سال: 2014
ISSN: 1462-0332,1462-0324
DOI: 10.1093/rheumatology/keu064.001